| 翻訳と辞書 |
| interval tree ： ウィキペディア英語版 |
interval tree
In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene. A similar data structure is the segment tree.
The trivial solution is to visit each interval and test whether it intersects the given point or interval, which requires O(''n'') time, where ''n'' is the number of intervals in the collection. Since a query may return all intervals, for example if the query is a large interval intersecting all intervals in the collection, this is asymptotically optimal; however, we can do better by considering output-sensitive algorithms, where the runtime is expressed in terms of ''m'', the number of intervals produced by the query. Interval trees have a query time of O(log ''n'' + ''m'') and an initial creation time of O(''n'' log ''n''), while limiting memory consumption to O(''n''). After creation, interval trees may be dynamic, allowing efficient insertion and deletion of an interval in O(log ''n''). If the endpoints of intervals are within a small integer range (e.g., in the range ()), faster data structures exist〔Range Queries#Semigroup operators〕 with preprocessing time O(''n'') and query time O(1+''m'') for reporting ''m'' intervals containing a given query point.
==Naive approach==
In a simple case, the intervals do not overlap and they can be inserted into a simple binary search tree and queried in O(log ''n'') time. However, with arbitrarily overlapping intervals, there is no way to compare two intervals for insertion into the tree since orderings sorted by the beginning points or the ending points may be different. A naive approach might be to build two parallel trees, one ordered by the beginning point, and one ordered by the ending point of each interval. This allows discarding half of each tree in O(log ''n'') time, but the results must be merged, requiring O(''n'') time. This gives us queries in O(''n'' + log ''n'') = O(''n''), which is no better than brute-force.
Interval trees solve this problem. This article describes two alternative designs for an interval tree, dubbed the ''centered interval tree'' and the ''augmented tree''.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「interval tree」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|